Concurrent Error Detection in Reed-Solomon Encoders and Decoders
نویسندگان
چکیده
Reed–Solomon (RS) codes are widely used to identify and correct errors in transmission and storage systems. When RS codes are used for high reliable systems, the designer should also take into account the occurrence of faults in the encoder and decoder subsystems. In this paper, self-checking RS encoder and decoder architectures are presented. The RS encoder architecture exploits some properties of the arithmetic operations in . These properties are related to the parity of the binary representation of the elements of the Galois Field. In the RS decoder, the implicit redundancy of the received codeword, under suitable assumptions explained in this paper, allows implementing concurrent error detection schemes useful for a wide range of different decoding algorithms with no intervention on the decoder architecture. Moreover, performances in terms of area and delay overhead for the proposed circuits are presented.
منابع مشابه
High-speed decoder of Reed-Solomon codes
A high speed decoding algorithm using a modified step-by-step method for t-error-correcting Reed-Solomon codes is introduced. Based on this algorithm, a sequential decoder and a vector decoder are then proposed. These two decoders can be constructed by four basic modules: the syndrome calculation module, the comparison module, the decision module, and the shift-control module. These decoders ca...
متن کاملReed-Solomon and Concatenated Codes with Applications in Space Communication
In this paper we provide a detailed description of Reed-Solomon (RS) codes, the most important algorithms for decoding them, and their use in concatenated coding systems for space applications. In the current literature there is scattered information regarding the bit-level implementation of such codes for either space systems or any other type of application. Consequently, we start with a gene...
متن کاملOn the Average Complexity of Reed-Solomon Algebraic List Decoders
We study the error dependent interpolation cost of Reed-Solomon (RS) list-decoders. Words corrupted by low weight errors require lower degree interpolation polynomials. By giving different upper bounds we quantitatively link the interpolation cost to the weight of the instantaneous channel error. To take advantage of this phenomenon, we propose modifications to interpolation algorithms that tra...
متن کاملA Universal Reed-Solomon Decoder
Two architecturesfor universal Reed-Solomon decoders are given. These decoders, called time-domain decoders, work directly on the raw data word as received without the usual syndrome calculation or power-sum-symmetric functions Up to the limitations of the working registers, the decoders can decode any Reed-Solomon codeword or BCH codeword in the presence of both errors and erasures. Provision ...
متن کاملLow-energy heterogeneous digit-serial Reed-Solomon codecs
Reed-Solomon (RS) codecs are used for error control coding in many applications such as digital audio, digital TV, software radio, CD players, and wireless and satellite communications. This paper considers software-based implementation of RS codecs where special instructions are assumed to be used to program finite field multiplication datapaths inside a domain-specific programmable digital-si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. VLSI Syst.
دوره 15 شماره
صفحات -
تاریخ انتشار 2007